Network Representation and Shortest Path Reflecting the Ramp Entry or Exit Direction Limitation

There are some ramp entry or exit direction limitations on networks. This kind of limitation is represented by successive passage prohibition (SPP). It indicates that the vehicles cannot successively pass two links with SPP attributes. However, the shortest-path tree sometimes cannot be expressed with a simple tree when a network having this limitation is represented with single nodes. In such a case, an accurate shortest path cannot be found by simply applying Dijkstra's algorithm. Therefore, we propose an intersection expansion to find the most accurate shortest-path tree. It is transformed automatically during the process of finding the shortest path.